A matrix-based approach to properness and inversion problems for rational surfaces

We present a matrix-based approach for deciding if the parameterization of an algebraic space surface is invertible or not, and for computing the inverse of the parametrization if it exists.     

Environment as a first class abstraction in multiagent systems

The current practice in multiagent systems typically associates the environment with resources that are external to agents and their communication infrastructure. Advanced uses of the environment include infrastructures for indirect coordination, such as digital pheromones, or support for governed interaction in electronic institutions. Yet, in general, the notion of environment is not well defined. Functionalities of the environment are often dealt with implicitly or in an ad hoc manner. This is not only poor engineering practice, it also hinders engineers to exploit the full potential of the environment in multiagent systems. In this paper, we put forward the environment as an explicit part of multiagent systems.We give a definition stating that the environment in a multiagent system is a first-class abstraction with dual roles: (1) the environment provides the surrounding conditions for agents to exist, which implies that the environment is an essential part of every multiagent system, and (2) the environment provides an exploitable design abstraction for building multiagent system applications. We discuss the responsibilities of such an environment in multiagent systems and we present a reference model for the environment that can serve as a basis for environment engineering. To illustrate the power of the environment as a design abstraction, we show how the environment is successfully exploited in a real world application. Considering the environment as a first-class abstraction in multiagent systems opens up new horizons for research and development in multiagent systems.     

Maternal depression and early positive parenting predict future conduct problems in young children with attention-deficit/hyperactivity disorder.

Children with attention-deficit/hyperactivity disorder (ADHD) are at risk for adverse outcomes such as substance abuse and criminality, particularly if they develop conduct problems. Little is known about early predictors of the developmental course of conduct problems among children with ADHD, however. Parental psychopathology and parenting were assessed in 108 children who first met Diagnostic and Statistical Manual of Mental Disorders (4th ed.) criteria for ADHD at 4-7 years old. When demographic variables and baseline ADHD and conduct problems were controlled, maternal depression predicted conduct problems 2-8 years following the initial assessment, whereas positive parenting during the structured parent- child interaction task predicted fewer future conduct problems. These findings suggest that maternal depression is a risk factor, whereas early positive parenting is a protective factor, for the developmental course of conduct problems among children with ADHD. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Nonpathological Lyapunov functions and discontinuous Carathéodory systems

Differential equations with discontinuous right-hand side and solutions intended in Carathéodory sense are considered. For these equations, sufficient conditions which guarantee both Lyapunov stability and asymptotic stability in terms of nonsmooth Lyapunov functions are given. An invariance principle is also proven.     

Analytical prediction of composite beams response in fire situations

In this paper an extension of the method of the Fourier series expansion to the fire analysis of composite beams is presented. In particular the extension concerns the introduction of the temperature dependent interaction of all the components: steel beams, concrete slab and steel connectors. These last are considered of finite stiffness, and a proper account is given to the combined effect of thermal degradation of the properties, and stress amplification caused by the differential thermal expansion across the interface.The proposed method compares very well with some experimental fire tests of simply supported and framed composite beams. Due to its relative simplicity and speed, it can be used for design purposes in evaluating the critical temperature in terms of critical deflection. Finally we recall that the method is capable of dealing with every type of fastening distribution, such as discontinuous or variable length.     

Biosorption of heavy metals by Saccharomyces cerevisiae: Effects of nutrient conditions

Studies took place to investigate the effects of different nutrient conditions on the biosorption ability and selectivity of heavy metals by Saccharomyces cerevisiae. After having grown in media supplemented with additional glucose, ammonium, phosphate or cysteine, the yeast was exposed to an equimolar solution of lead, cadmium, zinc and copper. Lead removal from a mixed solution was significantly higher than that of copper, followed by zinc and cadmium. Generally, yeasts from cysteine-rich media showed greatest sorption capacity whereas phosphate addition influenced zinc selectivity. In addition, glucose, fructose and sucrose as carbon sources were examined. Cultures grown in glucose had a better uptake than those cultivated with fructose at an incubation time of 30 min.     

Optimal bounds for the approximation of boolean functions and some applications

This paper presents an optimal bound on the Shannon function L(n,m,) that gives the worstcase circuit-size complexity to approximate, within an approximation degree at least , partial boolean functions having n inputs and domain size m. That is

Full-size image

. Our bound applies to any partial boolean function and any approximation degree, and thus completes the study of boolean function approximation introduced by Pippenger (1977).

Our results give an upper bound for the hardness function h(ƒ), introduced by Nisan and Wigderson (1994), which denotes the minimum value l for which there exists a circuit of size at most l that approximates a boolean function ƒ with degree at least 1/l. Indeed, if H(n) denotes the maximum hardness value achieved by boolean functions with n inputs, we prove that for almost every nH(n)n/3 + n² + O(1). The exponent n/3 in the above inequality implies that no family of boolean functions exists which has ‘full’ hardness. This fact establishes connections with Allender and Strauss' (1994) work that explores the structure of BPP.

Finally, we show that for almost every n and for almost every boolean function ƒ of n inputs we have h(ƒ)2^{n/3−2 log n}. The contribution in the proof of the upper bound for L(n, m, ) can be viewed as a set of technical results that globally show how boolean linear operators are ‘well’ distributed on the class of 4-regular domains. This property is then applied to approximate partial boolean functions on general domains using a suitable composition of boolean linear operators.     

An elementary proof of Sylvester’s double sums for subresultants

In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester’s formula was also recently proved by Lascoux and Pragacz using multi-Schur functions and divided differences. In this paper, we provide an elementary proof that uses only basic properties of matrix multiplication and Vandermonde determinants.     

A Web‐based Open‐source Geoinformation Tool for Regional Water Resources Assessment

Water Resources Management - To reduce the impact of droughts and increase the resilience of regional water systems, various competing demands, such as hydropower, supply, irrigation and river...